Recognition problems and communication complexity

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordered Biclique Partitions and Communication Complexity Problems

An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In...

متن کامل

On Communication Complexity of Classification Problems

This work introduces a model of distributed learning in the spirit of Yao’s communication complexity model. We consider a two-party setting, where each of the players gets a list of labelled examples and they communicate in order to jointly perform some learning task. To naturally fit into the framework of learning theory, we allow the players to send each other labelled examples, where each ex...

متن کامل

The Communication Complexity of Efficient Allocation Problems

We analyze the communication burden of surplus-maximizing allocations. We study both the continuous and discrete models of communication, measuring its burden with the dimensionality of the message space and the number of transmitted bits, respectively. In both cases, we offer a lower bound on the amount of communication. This bound is applied to the problem of allocating L heterogeneous object...

متن کامل

Randomized Communication Complexity for Linear Algebra Problems over Finite Fields

Finding the singularity of a matrix is a basic problem in linear algebra. Chu and Schnitger [3] first considered this problem in the communication complexity model, in which Alice holds the first half of the matrix and Bob holds the other half. They proved that the deterministic communication complexity is Ω(n2 log p) for an n×n matrix over the finite field Fp. Then, Clarkson and Woodruff [4] i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2004

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(03)00192-6